Minkowski sum of HV-polytopes in Rn
نویسندگان
چکیده
Minkowski sums cover a wide range of applications in many different fields like algebra, morphing, robotics, mechanical CAD/CAM systems ... This paper deals with sums of polytopes in a n dimensional space provided that both H-representation and V-representation are available i.e. the polytopes are described by both their half-spaces and vertices. The first method uses the polytope normal fans and relies on the ability to intersect dual polyhedral cones. Then we introduce another way of considering Minkowski sums of polytopes based on the primal polyhedral cones attached to each vertex. keywords: Computational Geometry, Convex Polytope, Minkowski Sum, Normal Fan, Polyhedrical Cone.
منابع مشابه
On a Special Class of Hyper-Permutahedra
Minkowski sums of simplices in Rn form an interesting class of polytopes that seem to emerge in various situations. In this paper we discuss the Minkowski sum of the simplices ∆k−1 in Rn where k and n are fixed, their flags and some of their face lattice structure. In particular, we derive a closed formula for their exponential generating flag function. These polytopes are simple, include both ...
متن کاملMaximal f-vectors of Minkowski sums of large numbers of polytopes
It is known that in the Minkowski sum of r polytopes in dimension d, with r < d, the number of vertices of the sum can potentially be as high as the product of the number of vertices in each summand [2]. However, the number of vertices for sums of more polytopes was unknown so far. In this paper, we study sums of polytopes in general orientations, and show a linear relation between the number o...
متن کاملMinkowski Sum of Polytopes and Its Normality
In this paper, we consider the normality or the integer decomposition property (IDP, for short) for Minkowski sums of integral convex polytopes. We discuss some properties on the toric rings associated with Minkowski sums of integral convex polytopes. We also study Minkowski sums of edge polytopes and give a sufficient condition for Minkowski sums of edge polytopes to have IDP.
متن کاملOn the Exact Maximum Complexity of Minkowski Sums of Polytopes
We present a tight bound on the exact maximum complexity of Minkowski sums of polytopes in R. In particular, we prove that the maximum number of facets of the Minkowski sum of k polytopes with m1,m2, . . . ,mk facets respectively is bounded from above by
متن کاملOn f-vectors of Minkowski additions of convex polytopes
The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial properties of the Minkowski sum with their own dual. In particular, we have a characterization of face lattice of the sum in terms of the face lattice of a given perfectly centered polytope. Exact f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1412.2562 شماره
صفحات -
تاریخ انتشار 2014